Evolution of Cooperation in a Heterogeneous Graph: Fixation Probabilities under Weak Selection
نویسندگان
چکیده
It has been shown that natural selection favors cooperation in a homogenous graph if the benefit-to-cost ratio exceeds the degree of the graph. However, most graphs related to interactions in real populations are heterogeneous, in which some individuals have many more neighbors than others. In this paper, we introduce a new state variable to measure the time evolution of cooperation in a heterogeneous graph. Based on the diffusion approximation, we find that the fixation probability of a single cooperator depends crucially on the number of its neighbors. Under weak selection, a cooperator with more neighbors has a larger probability of fixation in the population. We then investigate the average fixation probability of a randomly chosen cooperator. If a cooperator pays a cost for each of its neighbors (the so called fixed cost per game case), natural selection favors cooperation if the benefit-to-cost ratio is larger than the average degree. In contrast, if a cooperator pays a fixed cost and all its neighbors share the benefit (the fixed cost per individual case), cooperation is favored if the benefit-to-cost ratio is larger than the harmonic mean of the degree distribution. Moreover, increasing the graph heterogeneity will reduce the effect of natural selection.
منابع مشابه
Supporting Information for “Evolution of cooperation in a heterogeneous graph: Fixation probabilities under neutral selection ”
متن کامل
Fixation Probabilities for Any Configuration of Two Strategies on Regular Graphs
Population structure and spatial heterogeneity are integral components of evolutionary dynamics, in general, and of evolution of cooperation, in particular. Structure can promote the emergence of cooperation in some populations and suppress it in others. Here, we provide results for weak selection to favor cooperation on regular graphs for any configuration, meaning any arrangement of cooperato...
متن کاملEvolutionary dynamics on graphs: Efficient method for weak selection.
Investigating the evolutionary dynamics of game theoretical interactions in populations where individuals are arranged on a graph can be challenging in terms of computation time. Here, we propose an efficient method to study any type of game on arbitrary graph structures for weak selection. In this limit, evolutionary game dynamics represents a first-order correction to neutral evolution. Spati...
متن کاملNatural selection of cooperation and degree hierarchy in heterogeneous populations.
One of the current theoretical challenges to the explanatory powers of Evolutionary Theory is the understanding of the observed evolutionary survival of cooperative behavior when selfish actions provide higher fitness (reproductive success). In unstructured populations natural selection drives cooperation to extinction. However, when individuals are allowed to interact only with their neighbors...
متن کاملEvolution of cooperation on dynamical graphs
There are two key characteristic of animal and human societies: (1) degree heterogeneity, meaning that not all individual have the same number of associates; and (2) the interaction topology is not static, i.e. either individuals interact with different set of individuals at different times of their life, or at least they have different associations than their parents. Earlier works have shown ...
متن کامل